A large deviation theory proof of the abstract alphabet source coding theorem
نویسنده
چکیده
منابع مشابه
Small Robust Response-Surface Designs for Quantitative and Qualitative Factors
Alphabet Source Coding Theorem Revisited En-hui Yang and Zhen Zhang * University of Waterloo, Ontario CANADA, e-mail: [email protected] **University of Southern California, Los Angeles, CA 90089, USA, [email protected] The abstract alphabet source coding theorem is revisited. For coding at a fixed rate level, it is shown that for any fixed rate R > 0 and any memoryless abstract alphab...
متن کاملSecond-order noiseless source coding theorems
I. Kontoyiannis Appeared in IEEE Trans. Inform. Theory, 43, pp. 1339 1341, July 1997. Abstract { Shannon's celebrated source coding theorem can be viewed as a \one-sided law of large numbers." We formulate second-order noiseless source coding theorems for the deviation of the codeword lengths from the entropy. For a class of sources that includes Markov chains we prove a \one-sided central limi...
متن کاملOn principles of large deviation and selected data compression
The Shannon Noiseless coding theorem (the data-compression principle) asserts that for an information source with an alphabet X = {0, . . . , ` − 1} and an asymptotic equipartition property, one can reduce the number of stored strings (x0, . . . , xn−1) ∈ X n to `nh with an arbitrary small error-probability. Here h is the entropy rate of the source (calculated to the base `). We consider furthe...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملFrobenius kernel and Wedderburn's little theorem
We give a new proof of the well known Wedderburn's little theorem (1905) that a finite division ring is commutative. We apply the concept of Frobenius kernel in Frobenius representation theorem in finite group theory to build a proof.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 1988